2 research outputs found

    Aeroservoelastic modelling and control of a slender anti-air missile for active damping of longitudinal bending vibrations

    Get PDF
    Slender anti-air missiles experience longitudinal bending in supersonic flight and yet their autopilots are designed under the rigid-body assumption. Such autopilot design employs notch filters to remove the modal frequencies of the elastic airframe but this approach limits the autopilot bandwidth. In this paper, aeroservoelastic modelling and control of the ASTER 30 missile is proposed to enable autopilot design with extended bandwidth. The aeroservoelastic model combines missile flight dynamics, actuator dynamics and airframe elasticity, the latter focusing on longitudinal bending treated as a continuous Euler–Bernoulli beam problem. The beam is discretised leading to a nodal model and the modal analysis is then performed. The modal model is expressed in the state-space form and its order is reduced to enable optimal sensor placement and active damping control. The aeroservoelastic model of the ASTER 30 missile is further refined for control purposes by optimally choosing actuator inputs together with the number and position of sensors to be mounted on the missile airframe. Once these choices are made, several variants of active vibration damping control are proposed and analysed in order to enable an extended bandwidth for the autopilot by countering the airframe deformation measured by these sensors

    A Survey on Reachable Set Techniques for Fault Recoverability Assessment

    Get PDF
    The development of any fault-tolerant control solution is based on the strong assumption that fault situations can be accommodated. This paper provides a survey of four reachable set techniques to assess the fault recoverability property for constrained linear time invariant (LTI) systems by means of ellipsoid, zonotope, polytope and support function representations. These techniques are next applied to an angular velocity spacecraft model. A discussion is finally made to assess the computational complexity for the four algorithms
    corecore